General Upper Bounds on the Minimum Size of Covering Designs
نویسندگان
چکیده
منابع مشابه
Upper Bounds for Covering Designs by SimulatedAnnealingKari
A t ? (v; m; k;) covering design is a pair (X; A), where X is a set of v elements (called points) and A is a multiset of k-subsets of X (called blocks), such that every m-subset of X intersects at least members of A in at least t points. It is required that v k t and v m t. Such a covering design gives an upper bound on C (v; m; k; t), the number of blocks in a minimal t ? (v; m; k;) covering d...
متن کاملUpper Bounds on the Minimum Size of Hamilton Saturated Hypergraphs
For 1 6 ` < k, an `-overlapping k-cycle is a k-uniform hypergraph in which, for some cyclic vertex ordering, every edge consists of k consecutive vertices and every two consecutive edges share exactly ` vertices. A k-uniform hypergraph H is `-Hamiltonian saturated if H does not contain an `-overlapping Hamiltonian k-cycle but every hypergraph obtained from H by adding one edge does contain such...
متن کاملConstructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size
A graph G is said to be Cl-saturated if G contains no cycle of length l, but for any edge in the complement of G the graph G + e does contain a cycle of length l. The minimum number of edges of a Cl-saturated graph was shown by Barefoot et al. to be between n + c1 n l and n + c2 n l for some positive constants c1 and c2. This confirmed a conjecture of Bollobás. Here we improve the value of c2 f...
متن کاملa study on the effectiveness of textual modification on the improvement of iranian upper-intermediate efl learners’ reading comprehension
این پژوهش به منظور بررسی تأثیر اصلاح متنی بر بهبود توانایی درک مطلب زبان آموزان ایرانی بالاتر از سطح میانی انجام پذیرفت .بدین منظور 115 دانشجوی مرد و زن رشته مترجمی زبان انگلیسی در این پزوهش شرکت نمودند.
On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes
We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by generalizing a method due to S. Litsyn and A. Tiett avv ainen 10] and combining it with a new upper bound on the asymptotic information rate of non-binary codes. The new upper bound on the information rate is an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1999
ISSN: 0097-3165
DOI: 10.1006/jcta.1998.2927